An Experimental Evaluation of Algorithms for Computation of Internal Don’t-Cares in Boolean Networks
نویسنده
چکیده
The goal of this study is to evaluate the efficiency of don’t-care computation in boolean networks using several algorithms. The algorithms are compared using the following three parameters: (1) the amount of don’t-cares generated for the nodes of the network; (2) the sum total of literal counts in the factored forms of all nodes after the generated don’t-cares have been used to simplify each node in the boolean network; and (3) the runtime requirements.
منابع مشابه
Weighted Don’t Cares
In this paper we introduce and discuss the new concept of weighted don’t cares, i.e., we propose to enrich the notion of don’t cares, by assigning them a weight. These weights might be used to guide and refine the choices operated by the minimization algorithms in handling the don’t care conditions. We then propose, and experimentally validate, the first synthesis tool for functions with weight...
متن کاملGeneration of Efficient Codes for Realizing Boolean Functions in Nanotechnologies
1. Abstract We address the challenge of implementing reliable computation of Boolean functions in future nanocircuit fabrics. Such fabrics are projected to have very high defect rates. We overcome this limitation by using a combination of cheap but unreliable nanodevices and reliable but expensive CMOS devices. In our approach, defect tolerance is achieved through a novel coding of Boolean func...
متن کاملA Survey on Stability Measure of Networks
In this paper we discuss about tenacity and its properties in stability calculation. We indicate relationships between tenacity and connectivity, tenacity and binding number, tenacity and toughness. We also give good lower and upper bounds for tenacity.
متن کاملA ROBUST WINDOW-BASED MULTI-NODE MINIMIZATION TECHNIQUE USING BOOLEAN RELATIONS A Thesis by
A Robust Window-Based Multi-Node Minimization Technique Using Boolean Relations. (December 2007) Jeffrey Cobb, B.S., Texas A&M University Chair of Advisory Committee: Dr. Sunil Khatri Multi-node optimization using Boolean relations is a powerful approach for network minimization. The approach has been studied in theory, and so far its superiority over single node optimization techniques has onl...
متن کاملGeneration of Efficient Codes for Realizing Boolean Functions in Nanotechnologies
1. Abstract We address the challenge of implementing reliable computation of Boolean functions in future nanocircuit fabrics. Such fabrics are projected to have very high defect rates. We overcome this limitation by using a combination of cheap but unreliable nanodevices and reliable but expensive CMOS devices. In our approach, defect tolerance is achieved through a novel coding of Boolean func...
متن کامل